Nonlinear residual minimization by iteratively reweighted least squares
نویسندگان
چکیده
منابع مشابه
Nonlinear residual minimization by iteratively reweighted least squares
In this paper we address the numerical solution of minimal norm residuals of nonlinear equations in finite dimensions. We take particularly inspiration from the problem of finding a sparse vector solution of phase retrieval problems by using greedy algorithms based on iterative residual minimizations in the `p-norm, for 1 ≤ p ≤ 2. Due to the mild smoothness of the problem, especially for p→ 1, ...
متن کاملImproved Iteratively Reweighted Least Squares for Unconstrained Smoothed 퓁q Minimization
In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...
متن کاملLow-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
We present and analyze an efficient implementation of an iteratively reweighted least squares algorithm for recovering a matrix from a small number of linear measurements. The algorithm is designed for the simultaneous promotion of both a minimal nuclear norm and an approximatively low-rank solution. Under the assumption that the linear measurements fulfill a suitable generalization of the null...
متن کاملImproved Iteratively Reweighted Least Squares for Unconstrained
In this paper, we first study q minimization and its associated iterative reweighted algorithm for recovering sparse vectors. Unlike most existing work, we focus on unconstrained q minimization, for which we show a few advantages on noisy measurements and/or approximately sparse vectors. Inspired by the results in [Daubechies et al., Comm. Pure Appl. Math., 63 (2010), pp. 1–38] for constrained ...
متن کاملRobust spectrotemporal decomposition by iteratively reweighted least squares.
Classical nonparametric spectral analysis uses sliding windows to capture the dynamic nature of most real-world time series. This universally accepted approach fails to exploit the temporal continuity in the data and is not well-suited for signals with highly structured time-frequency representations. For a time series whose time-varying mean is the superposition of a small number of oscillator...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2016
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-016-9829-x